The Slater condition is generic in linear conic programming
نویسندگان
چکیده
We call a property generic if it holds for almost all problem instances. For linear conic problems, it has been shown in the literature that properties like uniqueness, strict complementarity or nondegeneracy of the optimal solution are generic under the assumption that Slater’s condition is fulfilled. The possibility that Slater’s condition generically fails has not been excluded. In this paper, we close this gap by proving that Slater’s condition is generic in linear conic programs. We also summarize genericity results of other properties and discuss connections between them.
منابع مشابه
Global Error Bounds for Convex Conic Problems
This paper aims at deriving and proving some Lipschitzian type error bounds for convex conic problems in a simple way First it is shown that if the recession directions satisfy Slater s condition then a global Lipschitzian type error bound holds Alternatively if the feasible region is bounded then the ordinary Slater condition guarantees a global Lipschitzian type error bound These can be consi...
متن کاملDuality Results for Conic Convex Programming
This paper presents a uni ed study of duality properties for the problem of minimizing a linear function over the intersection of an a ne space with a convex cone in nite dimension. Existing duality results are carefully surveyed and some new duality properties are established. Examples are given to illustrate these new properties. The topics covered in this paper include Gordon-Stiemke type th...
متن کاملA New Mathematical Approach based on Conic Quadratic Programming for the Stochastic Time-Cost Tradeoff Problem in Project Management
In this paper, we consider a stochastic Time-Cost Tradeoff Problem (TCTP) in PERT networks for project management, in which all activities are subjected to a linear cost function and assumed to be exponentially distributed. The aim of this problem is to maximize the project completion probability with a pre-known deadline to a predefined probability such that the required additional cost is min...
متن کاملGenericity Results in Linear Conic Programming - A Tour d'Horizon
This paper is concerned with so-called generic properties of general linear cone programs. Many results have been obtained on this subject during the last two decades. It has, e.g., been shown in [29] that uniqueness, strict complementarity and nondegeneracy of optimal solutions hold for almost all problem instances. Strong duality holds generically in a stronger sense: it holds for a generic s...
متن کاملA conic quadratic model for supply chain network design under hub, capacity, delay and lost sale
In this paper, mathematical models are proposed for simultaneously modeling location and inventory control decisions in a four echelon supply chain network considering capacity. The echelons considered in this paper include suppliers, warehouses, hubs and retailers. The aim of the model is to minimize the location, transportation and inventory control costs. Hence, a non-linear mixed integer pr...
متن کامل